Fast Evaluation of Vector Splines in Two DimensionsF
نویسندگان
چکیده
This paper presents an algorithm for the rapid evaluation of the vector spline in two dimensions. Our work is an extension of the fast evaluation of thin-plate spline by Beatson and Newsam. The algorithm is based on the fast multipole method and has an asymptotic CPU time estimate of O(N), while the direct calculation requires an amount of work of the order O(N 2), where N is the number of the data points. The relative error estimation shows that the fast algorithm produces good approximation.
منابع مشابه
Fast Evaluation of Vector Splines in Three
Vector spline techniques have been developed as general-purpose methods for vector eld reconstruction. However, such vector splines involve high computational complexity, which precludes applications of this technique to many problems using large data sets. In this paper, we develop a fast multipole method for the rapid evaluation of the vector spline in three dimensions. The algorithm depends ...
متن کاملFast Multipole Method for Accelerating the Evaluation of Splines
We consider the problem of interpolating scattered data using spline methods and present a general framework of using the multipole method to accelerate the evaluation of splines. The method depends on a tree-data structure and two hierarchical approximations: an upward multipole expansion approximation and a downward local Taylor series approximation. We also illustrate the performance of the ...
متن کاملFast evaluation of polyharmonic splines in three dimensions
This paper concerns the fast evaluation of radial basis functions. It describes the mathematics of hierarchical and fast multipole methods for fast evaluation of splines of the form
متن کاملFast Evaluation of Vector Splines in Two Dimensions
This paper presents an algorithm for the rapid evaluation of the vector spline in two dimensions. The algorithm is based on the fast multipole method and has an asymptotic CPU time estimate of O(N), where N is the number of data points. The main idea of the algorithm is to combine a cluster of evaluation kernels at diierent data sources into a single kernel in the form of a multipole expansion ...
متن کاملFast and stable evaluation of box-splines via the Bézier form
To repeatedly evaluate linear combinations of box-splines in a fast and stable way, in particular along knot planes, we convert to and tabulate the box-spline as piecewise polynomials in Bézier form. We show that the Bézier coefficients can be stored as integers and a rational scale factor and derive a hash table for efficiently accessing the Bézier pieces. The preprocessing, the resulting eval...
متن کامل